MINIMAL AND STATEWISE MINIMAL INTUITIONISTIC GENERAL L-FUZZY AUTOMATA

Authors

  • M. M. Zahedi Department of Mathematics, Graduate University of Advanced Tech- nology, Kerman, Iran
  • M. Shamsizadeh Department of Mathematics, Graduate University of Advanced Technology, Kerman, Iran
Abstract:

In this note, by considering the notions of the intuitionistic general L-fuzzy automaton and $(alpha, beta)$-language, we show that for any $(alpha, beta)$-language $mathcal{L}$, there exists a minimal intuitionistic general L-fuzzy automaton recognizing $mathcal{L}$.We prove that the minimal intuitionistic general L-fuzzy automaton is isomorphic with threshold $(alpha,beta)$ to any $(alpha, beta)$-reduced max-min intuitionistic general L-fuzzy automaton.%Also, we prove that the minimal intuitionistic general L-fuzzy automaton is an $(alpha, beta)$-reduced.Also, we show that  for any strong deterministic max-min intuitionistic general L-fuzzy automaton there exists a statewise $(alpha, beta)$-minimal intuitionistic general L-fuzzy automaton.In particular, a connection between the minimal and statewise  $(alpha, beta)$-minimal intuitionistic general L-fuzzy automaton is presented.%We show if $tilde{F}^*$ is an $(alpha, beta)$-complete $(alpha, beta)$-accessible deterministic max-min intuitionistic general L-fuzzy automaton and it is recognizing $(alpha, beta)$-language $mathcal{L}$, then the minimal $tilde{F}^*_{mathcal{L}}$ is homomorphism with threshold $(alpha, beta)$ to statewise $(alpha, beta)$-minimal $tilde{F}_{m}^*$, where $tilde{F}_{m}^*$ is statewise $(alpha, beta)$-equivalent to $tilde{F}^*$.Also, for a given intuitionistic general L-fuzzy automaton, we present two algorithms, which determinesstates of the minimal intuitionistic general L-fuzzy automaton and the statewise $(alpha, beta)$-minimal intuitionistic general L-fuzzy automaton.Finally, by giving some examples, we comparison minimal intuitionistic general L-fuzzy automaton and statewise $(alpha, beta)$-minimal intuitionistic general L-fuzzy automaton.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

minimal and statewise minimal intuitionistic general l-fuzzy automata

in this note, by considering the notions of the intuitionistic general l-fuzzy automaton and $(alpha, beta)$-language, we show that for any $(alpha, beta)$-language $mathcal{l}$, there exists a minimal intuitionistic general l-fuzzy automaton recognizing $mathcal{l}$.we prove that the minimal intuitionistic general l-fuzzy automaton is isomorphic with threshold $(alpha,beta)$ to any $(alpha, be...

full text

BL-general fuzzy automata and minimal realization: Based on the associated categories

The present paper is an attempt to study the minimal BL-general fuzzy automata which realizes the given fuzzy behavior. Of two methods applied for construction of such automaton presented here, one has been based on Myhill-Nerode's theory while the other has been based on derivatives of the given fuzzy behavior. Meanwhile, the categories of BL-general fuzzy automata and fuzzy behavior, along wi...

full text

Reduction of BL-general L-fuzzy Automata

In this paper, we show that for any BL-general L-fuzzy automaton (BL-GLFA) there exists a complete deterministic accessible reduced BL-general L-fuzzy automaton that recognizing the behavior of the BL-GLFA. Also, we prove that for any finite realization β, there exists a minimal complete deterministic BL-GLFA recognizing β. We prove any complete deterministic accessible reduced BL-GLFA is a min...

full text

Minimal solution of fuzzy neutrosophic soft matrix

The aim of this article is to study the concept of unique solvability of max-min fuzzy neutrosophic soft matrix equation and strong regularity of fuzzy neutrosophic soft matrices over Fuzzy Neutrosophic Soft Algebra (FNSA). A Fuzzy Neutrosophic Soft Matrix (FNSM) is said to have Strong, Linear Independent (SLI) column (or, in the case of fuzzy neutrosophic soft square matrices, to be strongly r...

full text

9337 Intuitionistic Fuzzy Automaton and the Minimal Machine

This paper presents a contribution to minimization of intuitionistic fuzzy automata. In this paper the concept of substitution property (SP) partition for a finite intuitionistic fuzzy automaton is formulated, and the quotient automaton with respect to an SP partition is defined.

full text

HYPERGROUPS AND GENERAL FUZZY AUTOMATA

In this paper, we first define the notion of a complete general fuzzyautomaton with threshold c and construct an $H_{nu}$- group, as well as commutativehypergroups, on the set of states of a complete general fuzzy automatonwith threshold c. We then define invertible general fuzzy automata, discussthe notions of “homogeneity, “separation, “thresholdness connected, “thresholdnessinner irreducible...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 13  issue 7

pages  131- 152

publication date 2016-12-30

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023